On splittable and unsplittable flow capacitated network design arc-set polyhedra
نویسندگان
چکیده
منابع مشابه
On splittable and unsplittable flow capacitated network design arc-set polyhedra
We study the polyhedra of splittable and unsplittable single arc–set relaxations of multicommodity flow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear–time separation algorithm for the residual capacity inequalities [19] and show that the separat...
متن کاملMathematical Programming Manuscript No. on Splittable and Unsplittable Ow Capacitated Network Design Arc{set Polyhedra
We study the polyhedra of splittable and unsplittable single arc{set relaxations of multicommodity ow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear{time separation algorithm for the residual capacity inequalities 19] and show that the separation...
متن کاملOn Splittable and Unsplittable Ow Capacitated Network Design Arc{set Polyhedra
We study the polyhedra of splittable and unsplittable arc sets of multicommodity ow capac-itated network design problems. We investigate the optimization problems over these polyhedra and the separation and lifting problems of valid inequalities for them. In particular, we give a linear-time separation algorithm for the residual capacity inequalities (Magnanti et al., 1993) and show that the se...
متن کاملOn capacitated network design cut-set polyhedra
This paper provides an analysis of capacitated network design cut–set polyhedra. We give a complete linear description of the cut–set polyhedron of the single commodity – single facility capacitated network design problem. Then we extend the analysis to single commodity – multifacility and multicommodity – multifacility capacitated network design problems. Valid inequalities described here are ...
متن کاملCapacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra
We consider the Capacitated Multi-Layer Network Design with Unsplittable demands (CMLND-U) problem. Given a two-layer network and a set of traffic demands, this problem consists in installing minimum cost capacities on the upper layer so that each demand is routed along a unique ”virtual” path (even using a unique capacity on each link) in this layer, and each installed capacity is in turn asso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2002
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s101070100269